Designing Persian Floral Patterns using Circle Packing
نویسندگان
چکیده
In this paper, we present a novel approach toward generating floral patterns. We extract the essence of a pattern aside from its appearance and geometry into combinatorial elements. As a result, existing patterns can be reshaped while preserving their essence. Furthermore, we can create new patterns that adhere to high level concepts such as imperfect symmetry and visual balance. By decomposing floral patterns into a configuration of circles and angles, we can reconstruct this patterns on different surfaces given a conformal mapping.
منابع مشابه
Animating Persian Floral Patterns
In this paper we describe Persian floral patterns and explore techniques for animating them. We present several approaches for this dynamic recreation: visualizing pattern symmetries, illustrating their design process, and simulating plant growth. For creating a pleasant illusion of a never-ending movie, we also explore an infinitely cycling effect for self-similar patterns. The construction of...
متن کاملCircle Packing Explorations
Circle packing can be seen as the art of placing tangent circles on the plane, leaving as little unoccupied space as possible. Circle packing is a very attractive field of mathematics, from several points of view. It contains interesting and complex questions, both mathematical and algorithmical, and keeps its properties through a wide range of geometric transformations. There are several ways ...
متن کاملHexagonal circle patterns and integrable systems. Patterns with constant angles
The theory of circle packings and, more generally, of circle patterns enjoys in recent years a fast development and a growing interest of specialists in complex analysis and discrete mathematics. This interest was initiated by Thurston’s rediscovery of the Koebe-Andreev theorem [K] about circle packing realizations of cell complexes of a prescribed combinatorics and by his idea about approximat...
متن کاملPatterns with constant angles
The theory of circle packings and, more generally, of circle patterns enjoys in recent years a fast development and a growing interest of specialists in complex analysis and discrete mathematics. This interest was initiated by Thurston’s rediscovery of the Koebe-Andreev theorem [K] about circle packing realizations of cell complexes of a prescribed combinatorics and by his idea about approximat...
متن کاملRigidity of Infinite (circle) Packings
The nerve of a packing is a graph that encodes its combinatorics. The vertices of the nerve correspond to the packed sets, and an edge occurs between two vertices in the nerve precisely when the corresponding sets of the packing intersect. The nerve of a circle packing and other well-behaved packings, on the sphere or in the plane, is a planar graph. It was an observation of Thurston [Thl, Chap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012